Preprint ANL/MCS-P1888-0511 DIFFERENCE FILTER PRECONDITIONING FOR LARGE COVARIANCE MATRICES
نویسندگان
چکیده
In many statistical applications one must solve linear systems corresponding to large, dense, and possibly irregularly structured covariance matrices. These matrices are often illconditioned; for example, the condition number increases at least linearly with respect to the size of the matrix when observations of a random process are obtained from a fixed domain. This paper discusses a preconditioning technique based on a differencing approach such that the preconditioned covariance matrix has a bounded condition number independent of the size of the matrix for some important process classes. When used in large scale simulations of random processes, significant improvement is observed for solving these linear systems with an iterative method.
منابع مشابه
Preprint ANL/MCS-P3039-0912 ANALYSIS AND PRACTICAL USE OF FLEXIBLE BICGSTAB
A flexible version of the BiCGStab algorithm for solving a linear system of equations is analyzed. We show that under variable preconditioning, the perturbation to the outer residual norm is of the same order as that to the application of the preconditioner. Hence, in order to maintain a similar convergence behavior to BiCGStab while reducing the preconditioning cost, the flexible version can b...
متن کاملPreprint ANL/MCS-P5112-0314 DATA STRUCTURE AND ALGORITHMS FOR RECURSIVELY LOW-RANK COMPRESSED MATRICES
We present a data structure and several operations it supports for recursively lowrank compressed matrices; that is, the diagonal blocks of the matrix are recursively partitioned, and the off-diagonal blocks in each partition level admit a low-rank approximation. Such a compression is embraced in many linearor near-linear-time methods for kernel matrices, including the fast multipole method, th...
متن کاملPreprint ANL/MCS-P4001-1212 A FAST SUMMATION TREE CODE FOR MATÉRN KERNEL
The Matérn family of functions is a widely used covariance kernel in spatial statistics for Gaussian process modeling, which in many instances requires calculation with a covariance matrix. In this paper, we design a fast summation algorithm for the Matérn kernel in order to efficiently perform matrix-vector multiplications. This algorithm is based on the Barnes–Hut tree code framework, and sev...
متن کاملTuning of Extended Kalman Filter using Self-adaptive Differential Evolution Algorithm for Sensorless Permanent Magnet Synchronous Motor Drive
In this paper, a novel method based on a combination of Extended Kalman Filter (EKF) with Self-adaptive Differential Evolution (SaDE) algorithm to estimate rotor position, speed and machine states for a Permanent Magnet Synchronous Motor (PMSM) is proposed. In the proposed method, as a first step SaDE algorithm is used to tune the noise covariance matrices of state noise and measurement noise i...
متن کاملPreprint ANL/MCS-P1693-1109 COMPUTING f(A)b VIA LEAST SQUARES POLYNOMIAL APPROXIMATIONS
Abstract. Given a certain function f , various methods have been proposed in the past for addressing the important problem of computing the the matrix-vector product f(A)b without explicitly computing the matrix f(A). Such methods were typically used to compute a specific function f , a common case being that of the exponential. This paper discusses a procedure based on least squares polynomial...
متن کامل